A Novel Algorithm for Calculation of the Extreme Eigenvalues of Large Hermitian Matrices

نویسنده

  • YUKO OKAMOTO
چکیده

A new fast algorithm for calculating a few maximum (or minimum) eigenvalues-&nd the corresponding eigenvectors of large N x N Hermitian m&rices is presented. The method is based on a molecular dynamics algorithm for N coupled harmonic-oscillators. The time step for iteration is chosen so that only the normal mode with _ _. _ the maximum eigenvalue grows exponentially. Other eigenvalues and eigenvectors are obtained one by one from the largest eigenvalue by repea.ting the process in subspaces orthogonal to the previous modes. The characteristics of the algorithm lie in the simplicity, speed (CPU time 0: N2), and memory efficiency (O(N) besides the matrix). The effectiveness of the algorithm is illustrated by calculation of the groundstate and first-excited state energies of the Heisenberg model for an antiferromagnetic chain with N up to 16384.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing the Matrix Geometric Mean of Two HPD Matrices: A Stable Iterative Method

A new iteration scheme for computing the sign of a matrix which has no pure imaginary eigenvalues is presented. Then, by applying a well-known identity in matrix functions theory, an algorithm for computing the geometric mean of two Hermitian positive definite matrices is constructed. Moreover, another efficient algorithm for this purpose is derived free from the computation of principal matrix...

متن کامل

Inside the eigenvalues of certain Hermitian Toeplitz band matrices

While extreme eigenvalues of large Hermitian Toeplitz matrices have been studied in detail for a long time, much less is known about individual inner eigenvalues. This paper explores the behavior of the jth eigenvalue of an n-by-n banded Hermitian Toeplitz matrix as n goes to infinity and provides asymptotic formulas that are uniform in j for 1 ≤ j ≤ n. The real-valued generating function of th...

متن کامل

A strategy for detecting extreme eigenvalues bounding gaps in the discrete spectrum of self-adjoint operators

For a self-adjoint linear operator with discrete spectrum or a Hermitian matrix the “extreme” eigenvalues define the boundaries of clusters in the spectrum of real eigenvalues. The outer extreme ones are the largest and the smallest eigenvalues. If there are extended intervals in the spectrum in which no eigenvalues are present, the eigenvalues bounding these gaps are the inner extreme eigenval...

متن کامل

A Filtered Lanczos Procedure for Extreme and Interior Eigenvalue Problems

When combined with Krylov projection methods, polynomial filtering can provide a powerful method for extracting extreme or interior eigenvalues of large sparse matrices. This general approach can be quite efficient in the situation when a large number of eigenvalues is sought. However, its competitiveness depends critically on a good implementation. This paper presents a technique based on such...

متن کامل

Majorization Bounds for Ritz Values of Hermitian Matrices∗

Given an approximate invariant subspace we discuss the effectiveness of majorization bounds for assessing the accuracy of the resulting Rayleigh-Ritz approximations to eigenvalues of Hermitian matrices. We derive a slightly stronger result than previously for the approximation of k extreme eigenvalues, and examine some advantages of these majorization bounds compared with classical bounds. From...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992